Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
نویسندگان
چکیده
Wegeneralize the linear-time shortest-paths algorithm for planar graphswith nonnegative edge-weights of Henzinger et al. (1994) to work for any proper minor-closed class of graphs.We argue that their algorithm can not be adapted by standardmethods to all proper minor-closed classes. By using recent deep results in graph minor theory, we show how to construct an appropriate recursive division in linear time for any graph excluding a fixed minor and how to transform the graph and its division afterwards, so that it has maximum degree three. Based on such a division, the original framework of Henzinger et al. can be applied. Afterwards, we show that using this algorithm, one can implement Mehlhorn’s (1988) 2-approximation algorithm for the Steiner tree problem in linear time on these graph classes. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Algorithmic graph minor theory: approximation, parameterized complexity, and practical aspects
Theoretical computer science provides us with tools and techniques to classify problems as efficiently solvable or computationally hard. But even hard problems have to be solved and there exist various ways to attack them. One way is to restrict the input to certain classes that are computationally more feasible. In the case of graph-theoretic problems, this is akin to considering the problem o...
متن کاملA Faster Approximation Algorithm for the Steiner Tree Problem in Graphs
The Steiner tree problem requires a shortest tree spanning a given vertex subset S within graph G = @‘, El. Two heuristics finding approximate Steiner trees no longer than 11/6 times of the optima1 length appeared recently. They run in time O(CY + KS2 + S4) and O(a + l@ + S3s), respectively, where LY is the time complexity of the all-pairs-shortest-paths problem. We reduce the runtime of the fi...
متن کاملNode-Weighted Network Design in Planar and Minor-Closed Families of Graphs
We consider node-weighted network design in planar and minor-closed families of graphs. In particular we focus on the edge-connectivity survivable network design problem (EC-SNDP). The input consists of a node-weighted undirected graph G = (V,E) and integral connectivity requirements r(uv) for each pair of nodes uv. The goal is to find a minimum node-weighted subgraph H of G such that, for each...
متن کاملApproximation Algorithms for Geometric Problems
This chapter surveys approximation algorithms for hard geometric problems. The problems we consider typically take inputs that are point sets or polytopes in twoor three-dimensional space, and seek optimal constructions, (which may be trees, paths, or polytopes). We limit attention to problems for which no polynomial-time exact algorithms are known, and concentrate on bounds for worst-case appr...
متن کاملToward Practical Planar Graph Algorithms
of “ Toward Practical Planar Graph Algorithms ” by David Elliot Eisenstat, Ph.D., Brown University, May 2014 Many optimization problems involving graphs naturally feature road networks, grids, or other large planar graphs. By exploiting the special structure of planar graphs, it is often possible to design algorithms that are faster or give better results than their counterparts for general gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009